全文获取类型
收费全文 | 711篇 |
免费 | 85篇 |
国内免费 | 8篇 |
专业分类
化学 | 12篇 |
晶体学 | 1篇 |
力学 | 7篇 |
综合类 | 16篇 |
数学 | 629篇 |
物理学 | 139篇 |
出版年
2023年 | 14篇 |
2022年 | 34篇 |
2021年 | 23篇 |
2020年 | 19篇 |
2019年 | 24篇 |
2018年 | 19篇 |
2017年 | 41篇 |
2016年 | 27篇 |
2015年 | 20篇 |
2014年 | 68篇 |
2013年 | 54篇 |
2012年 | 50篇 |
2011年 | 33篇 |
2010年 | 41篇 |
2009年 | 49篇 |
2008年 | 38篇 |
2007年 | 47篇 |
2006年 | 24篇 |
2005年 | 22篇 |
2004年 | 14篇 |
2003年 | 12篇 |
2002年 | 22篇 |
2001年 | 13篇 |
2000年 | 15篇 |
1999年 | 3篇 |
1998年 | 9篇 |
1997年 | 4篇 |
1996年 | 7篇 |
1995年 | 6篇 |
1994年 | 4篇 |
1993年 | 4篇 |
1992年 | 4篇 |
1991年 | 3篇 |
1990年 | 1篇 |
1989年 | 3篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 4篇 |
1984年 | 5篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1976年 | 3篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1957年 | 2篇 |
排序方式: 共有804条查询结果,搜索用时 15 毫秒
81.
In this paper, the statistical multiplexing of independent fractional Brownian traffic streams with the same Hurst value 0.5<H<1 is studied. The buffer overflow probabilities based on steady-state and transient queue length tail distributions are used respectively as the common performance criterion. Under general conditions, the minimal buffer allocation to the merged traffic is identified in either case so that strictly positive bandwidth savings are realized. Impact of the common H value on multiplexing gains is investigated. The analytical results are applicable in data network engineering problems, where ATM is deployed as the transport network carrying long-range dependent data traffic. 相似文献
82.
The multilevel generalized assignment problem is a problem of assigning agents to tasks where the agents can perform tasks at more than one efficiency level. A profit is associated with each assignment and the objective of the problem is profit maximization. Two heuristic solution methods are presented for the problem. The heuristics are developed from solution methods for the generalized assignment problem. One method uses a regret minimization approach whilst the other method uses a repair approach on a relaxation of the problem. The heuristics are able to solve moderately large instances of the problem rapidly and effectively. Procedures for deriving an upper bound on the solution of the problem are also described. On larger and harder instances of the problem one heuristic is particularly effective. 相似文献
83.
This paper studied the cost allocation for the unfunded liability in a defined benefit pension scheme incorporating the stochastic phenomenon of its returns. In the recent literature represented by Cairns and Parker [Insurance: Mathematics and Economics 21 (1997) 43], Haberman [Insurance: Mathematics and Economics 11 (1992) 179; Insurance: Mathematics and Economics 13 (1993) 45; Insurance: Mathematics and Economics 14 (1994) 219; Insurance: Mathematics and Economics 14 (1997) 127], Owadally and Haberman [North American Actuarial Journal 3 (1999) 105], the fund level is modeled based on the plan dynamics and the returns are generated through several stochastic processes to reflect the current realistic economic perspective to see how the contribution changed as the cost allocation period increased. In this study, we generalize the previous constant value assumption in cost amortization by modeling the returns and valuation rates simultaneously. Taylor series expansion is employed to approximate the unconditional and conditional moments of the plan contribution and fund level. Hence the stability of the plan contribution and the fund size under different allocation periods could be estimated, which provide valuable information adding to the previous works. 相似文献
84.
针对不确定环境下具有不同供应合约的供应商选择与订单分配问题,本文构建了基于风险-均值分析的模糊两阶段多周期集成优化模型。与传统的该问题研究并未充分考虑供应商选择与订单分配两阶段决策的交互影响不同,在该模型中,第一阶段供应商选择的评价目标依赖于后期实际运营中的订单分配决策;并考虑未来需求和实际运营成本的不确定性,引入在险价值和期望值两种决策准则对供应商选择方案的绩效进行评价。提出了该模型的分析求解方法,在险价值得以精确评估,期望值被控制在确定的误差范围内,并可以达到足够的精度要求。 相似文献
85.
《Operations Research Letters》2022,50(5):470-474
An independent set game is a cooperative game dealing with profit sharing in the maximum independent set problem. A population monotonic allocation scheme is a rule specifying how to share the profit of each coalition among its participants such that every participant is better off when the coalition expands. In this paper, we provide a necessary and sufficient characterization for independent set games admitting population monotonic allocation schemes. Moreover, our characterization can be verified efficiently. 相似文献
86.
本文针对输出型煤炭码头船货匹配下泊位动态分配问题,构建了堆场-取装线-泊位-船舶联合分配优化数学模型,并设计了采用仿真推演策略解码的遗传算法求解。首先,综合考虑船舶、泊位、堆场、取装线、煤种、航道开放时间和装船作业规则等要素,以船舶在港时间最短和作业效率最大为目标建立了相应的多约束多目标优化模型。然后,综合多目标优化、遗传算法以及仿真推演技术,设计了相应的遗传算法求解,包括:组合式编码、采用仿真推演策略的解码方法,追加了具有合法性检查的染色体生成算法,设计了采用多种策略的遗传操作等。最后实例表明,本算法的执行效率高而且优化效果好。 相似文献
87.
Robert S. Maier 《Random Structures and Algorithms》1991,2(4):379-420
We analyze the performance of a prototypical scheme for shared storage allocation: two initially empty stacks evolving in a contiguous block of memory of size m. We treat the case in which the stacks are more likely to shrink than grow, but with the probabilities of insertion and deletion allowed to depend arbitrarily on stack height as a fraction of m. New results are obtained on the m → ∞ asymptotics of the stack collision time, and of the final stack heights. The results of Wentzell and Freidlin on the large deviations of Markov chains are used, and the relation of their formalism to the Hamiltonian formulation of classical mechanics is emphasized. Certain results on higher-order asymptotics follow from WKB expansions. 相似文献
88.
Josep Maria Izquierdo 《TOP》2006,14(2):375-398
The paper introduces a refinement of the notion of population monotonic allocation scheme, called regular population monotonic
allocation scheme (regularpmas). This refinement is based on economic situations in which players may have to select new partners from a set of potential
players and in which there exist certain capacity constraints. A sufficient condition for the existence of a regularpmas is given. For the class of games with regularpmas, we prove that the core coincides with the Davis and Maschler and the Mas-Colell bargaining sets. 相似文献
89.
Vivek F. Farias 《Operations Research Letters》2006,34(2):180-190
We consider a problem of allocating limited quantities of M types of resources among N independent activities that evolve over T epochs. In each epoch, we assign to each activity a task which consumes resources, generates utility, and determines the subsequent state of the activity. We study the complexity of, and approximation algorithms for, maximizing average utility. 相似文献
90.
Paolo Battocchio Francesco Menoncin Olivier Scaillet 《Annals of Operations Research》2007,152(1):141-165
In a financial market with one riskless asset and n risky assets whose prices are lognormal, we solve in a closed form the problem of a pension fund maximizing the expected
CRRA utility of its surplus till the (stochastic) death time of a representative agent. We consider a unique asset allocation
problem for both accumulation and decumulation phases. The optimal investment in the risky assets must decrease during the
first phase and increase during the second one. We accordingly suggest it is not optimal to manage the two phases separately,
and outsourcing of allocation decisions should be avoided in both phases.
JEL: G23, G11
MSC 2000: 62P05, 91B28, 91B30, 91B70, 93E20 相似文献